全文获取类型
收费全文 | 847篇 |
免费 | 46篇 |
国内免费 | 43篇 |
专业分类
化学 | 53篇 |
晶体学 | 2篇 |
力学 | 65篇 |
综合类 | 7篇 |
数学 | 614篇 |
物理学 | 195篇 |
出版年
2023年 | 4篇 |
2022年 | 8篇 |
2021年 | 14篇 |
2020年 | 11篇 |
2019年 | 11篇 |
2018年 | 13篇 |
2017年 | 23篇 |
2016年 | 15篇 |
2015年 | 18篇 |
2014年 | 26篇 |
2013年 | 61篇 |
2012年 | 17篇 |
2011年 | 32篇 |
2010年 | 28篇 |
2009年 | 37篇 |
2008年 | 45篇 |
2007年 | 42篇 |
2006年 | 38篇 |
2005年 | 53篇 |
2004年 | 19篇 |
2003年 | 28篇 |
2002年 | 38篇 |
2001年 | 36篇 |
2000年 | 37篇 |
1999年 | 34篇 |
1998年 | 32篇 |
1997年 | 20篇 |
1996年 | 20篇 |
1995年 | 23篇 |
1994年 | 9篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 14篇 |
1989年 | 11篇 |
1988年 | 12篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 14篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 8篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1973年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有936条查询结果,搜索用时 46 毫秒
1.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
2.
Belov V. V. Dobrokhotov S. Yu. Maksimov V. A. 《Theoretical and Mathematical Physics》2003,135(3):765-791
Different versions of the Darboux–Weinstein theorem guarantee the existence of action–angle-type variables and the harmonic-oscillator variables in a neighborhood of isotropic tori in the phase space. The procedure for constructing these variables is reduced to solving a rather complicated system of partial differential equations. We show that this system can be integrated in quadratures, which permits reducing the problem of constructing these variables to solving a system of quadratic equations. We discuss several applications of this purely geometric fact in problems of classical and quantum mechanics. 相似文献
3.
M. D. Srinivas 《Pramana》2003,60(6):1137-1152
We derive an optimal bound on the sum of entropic uncertainties of two or more observables when they are sequentially measured
on the same ensemble of systems. This optimal bound is shown to be greater than or equal to the bounds derived in the literature
on the sum of entropie uncertainties of two observables which are measured on distinct but identically prepared ensembles
of systems. In the case of a two-dimensional Hilbert space, the optimum bound for successive measurements of two-spin components,
is seen to be strictly greater than the optimal bound for the case when they are measured on distinct ensembles, except when
the spin components are mutually parallel or perpendicular 相似文献
4.
Using a method of uniform approximations, necessary and sufficient conditions for a nonsmooth constrained vector-valued minimax problem are established in terms of Mordukhovich subdifferentials. 相似文献
5.
关于可达矩阵的求法探讨 总被引:6,自引:0,他引:6
在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 . 相似文献
6.
We show that the algorithm presented in an earlier paper by Studniarski (Numer. Math., 55:685–693, 1989) can be applied, after only a small modification, to approximate numerically Clarke’s subgradients of semismooth functions
of two variables. Results of computational testing of this modified algorithm are also reported.
相似文献
7.
Cristinel Mortici 《Czechoslovak Mathematical Journal》2005,55(3):709-718
In this paper we give some new results concerning solvability of the 1-dimensional differential equation y′ = f(x, y) with initial conditions. We study the basic theorem due to Picard. First we prove that the existence and uniqueness result
remains true if f is a Lipschitz function with respect to the first argument. In the second part we give a contractive method for the proof
of Picard theorem. These considerations allow us to develop two new methods for finding an approximation sequence for the
solution. Finally, some applications are given. 相似文献
8.
Li Changjun; Li Zheng; Evans David J.; Zhang Tie 《IMA Journal of Numerical Analysis》2003,23(4):581-592
Golub et al. (2001, BIT, 41, 7185) gave a generalizedsuccessive over-relaxation method for the augmented systems.In this paper, the connection between the SOR-like method andthe preconditioned conjugate gradient (PCG) method for the augmentedsystems is investigated. It is shown that the PCG method isat least as accurate (fast) as the SOR-like method. Numericalexamples demonstrate that the PCG method is much faster thanthe SOR-like method. 相似文献
9.
This article concerns the existence of global smooth solution for scalar conservation laws with degenerate viscosity in 2-dimensional space. The analysis is based on successive approximation and maximum principle. 相似文献
10.
Eitan Altman 《Mathematical Methods of Operations Research》1993,37(2):151-170
We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with unbounded cost. We are interested in (1) the convergence of finite horizon MDPs to the infinite horizon MDP, (2) convergence of MDPs with a truncated state space to the problem with infinite state space, (3) convergence of MDPs as the discount factor goes to a limit. In all these cases we establish the convergence of optimal values and policies. Moreover, based on the optimal policy for the limiting problem, we construct policies which are almost optimal for the other (approximating) problems. Based on the convergence of MDPs with a truncated state space to the problem with infinite state space, we show that an optimal stationary policy exists such that the number of randomisations it uses is less or equal to the number of constraints plus one. We finally apply the results to a dynamic scheduling problem.This work was partially supported by the Chateaubriand fellowship from the French embassy in Israel and by the European Grant BRA-QMIPS of CEC DG XIII 相似文献